Temporal scaling in information propagation
نویسندگان
چکیده
منابع مشابه
Temporal scaling in information propagation
For the study of information propagation, one fundamental problem is uncovering universal laws governing the dynamics of information propagation. This problem, from the microscopic perspective, is formulated as estimating the propagation probability that a piece of information propagates from one individual to another. Such a propagation probability generally depends on two major classes of fac...
متن کاملSupplementary Materials: Temporal scaling in information propagations
The dataset we use in all experiments is a benchmark dataset that was released as a task of the 13th International Conference on Web Information System Engineering (WISE 2012 Challenge). The dataset contains crawled users and retweeting behaviors between Aug 24, 2009 and Dec 31, 2011 1 from a Chinese social media website Sina Weibo (http://www.weibo.com). We cleaned the data by removing inactiv...
متن کاملUncovering the structure and temporal dynamics of information propagation
Time plays an essential role in the diffusion of information, influence, and disease over networks. In many cases we can only observe when a node is activated by a contagion— when a node learns about a piece of information, makes a decision, adopts a new behavior, or becomes infected with a disease. However, the underlying network connectivity and transmission rates between nodes are unknown. I...
متن کاملMining the Temporal Dimension of the Information Propagation
In the last decade, Social Network Analysis has been a field in which the effort devoted from several researchers in the Data Mining area has increased very fast. Among the possible related topics, the study of the information propagation in a network attracted the interest of many researchers, also from the industrial world. However, only a few answers to the questions “How does the informatio...
متن کاملScaling Analysis of Affinity Propagation
We analyze and exploit some scaling properties of the affinity propagation (AP) clustering algorithm proposed by Frey and Dueck [Science 315, 972 (2007)]. Following a divide and conquer strategy we setup an exact renormalization-based approach to address the question of clustering consistency, in particular, how many cluster are present in a given data set. We first observe that the divide and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Scientific Reports
سال: 2014
ISSN: 2045-2322
DOI: 10.1038/srep05334